AIRCRAFT SCHEDULING MODELS BY USING DYNAMIC PROGRAMMING APPROACH
نویسندگان
چکیده
منابع مشابه
A Dynamic Programming Approach to the Aircraft Sequencing Problem
In this report, a number of Dynamic Programming algorithms for three versions of the Aircraft Sequencing problem are developed. In these, two alternative objectives are considered: How to land all of a prescribed set of airplanes as soon as possible, or alternatively, how t6minimize the total passenger waiting time. All these three versions are "static", namely, no intermediate aircraft arrival...
متن کاملA Dynamic Programming Approach for Aircraft Conflict Detection∗
This paper describes an approach for mid-range conflict detection between two aircraft with intersecting straight line nominal trajectories. By modeling wind disturbances as normally distributed random noise, we compute analytic estimates of the conflict probability for any given conflict scenario. We then formulate the conflict detection problem as a finite horizon decision problem where the d...
متن کاملScheduling Policy Design using Stochastic Dynamic Programming
OF THE DISSERTATION Scheduling Policy Design using Stochastic Dynamic Programming by Robert Glaubius Doctor of Philosophy in Computer Science Washington University in St. Louis, 2009 Research Advisor: Professor William D. Smart Scheduling policies for open soft real-time systems must be able to balance the competing concerns of meeting their objectives under exceptional conditions while achievi...
متن کاملRunway Scheduling Using Generalized Dynamic Programming
ly, the runway scheduling problem (RSP) can be thought of as a job shop scheduling problem [11] with precedence and release time constraints, where the objective is to sequence a set of jobs (aircraft) in a particular order to be processed by a processor (runway) so that some cost function is minimized. For the runway scheduling problem, one wants to find an efficient schedule for aircraft to u...
متن کاملOver-Constrained Scheduling using Dynamic Programming
In this paper, we demonstrate the use of stochastic dynamic programming to solve over-constrained scheduling problems. In particular, we propose a decision method for efficiently calculating, prior to start of execution, the optimal decision for every possible situation encountered in sequential, predictable, overconstrained scheduling domains. We present our resuits using an example problem fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 1992
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.1991.440_109